Forward error correction with compression coding

ABSTRACT

Compression coding techniques are proposed for use with forward error correction (FEC) coding, which may provide higher information rates by reducing the proportion of redundant bits relative to information bits that are transmitted from a transmitter to a receiver. In one example, the transmitter calculates a plurality of determiners from a set of information bits, where each determiner is calculated as a first function of a respective first subset of the information bits. The transmitter then calculates a nub as a second function of the plurality of determiners, where the nub comprises a number of redundant bits that is less than a number of bits comprised in the plurality of determiners. The set of information bits is transmitted to the receiver in a first manner, and the nub is transmitted to the receiver in a second manner, where the first manner may be distinct from the second manner.

TECHNICAL FIELD

This document relates to the technical field of communications, and specifically to techniques for error control and correction.

BACKGROUND

In communications, a transmitter uses a particular modulation format to map bits of data to symbols, which it then transmits as a signal over a communications channel to a receiver. The receiver applies an inverse process of demodulation to the received signal to produce estimates of the symbols, the data bits, or both. During its transmission over the channel, the signal may experience noise and/or distortion. Noise and/or distortion may also be contributed to the signal by components of the transmitter and/or receiver. The noise and/or distortion experienced by the signal may lead to errors in the symbols or bits recovered at the receiver.

The reliability of a communications channel may be characterised by the Bit Error Ratio or Bit Error Rate (BER), which measures the ratio of the expected number of erroneously received bits (or symbols) to the total number of bits (or symbols) that are transmitted over the communications channel. A given application may have a maximum BER tolerance. For example, an application may require that the BER not exceed 10⁻¹⁶.

Forward Error Correction (FEC) techniques may be used to reduce the BER. FEC encoding performed at a transmitter maps input information bits to FEC-encoded bits, which include redundant information, such as parity or check symbols. For simplicity, FEC-encoded bits are often arranged in a systematic form, meaning that that the original information bits are followed, separately, by the redundant bits. FEC decoding subsequently performed at a receiver uses the redundant information to detect and correct bit errors. In an optical communication network using FEC, the bits of data that undergo modulation at the transmitter have already been FEC-encoded. Similarly, the demodulation performed at the receiver is followed by FEC decoding.

FEC is advantageous in that it may permit error control without the need to resend data packets. However, this is at the cost of increased overhead. The amount of overhead or redundancy added by a FEC encoder may be characterized by the information rate R, where R is defined as the ratio of the amount of input information to the amount of data that is output after FEC encoding (which includes the overhead). For example, if FEC encoding adds 25% overhead, then for every four information bits that are to be FEC-encoded, the FEC encoding will add 1 bit of overhead, resulting in 5 FEC-encoded data bits to be transmitted to the receiver. This corresponds to an information rate R=4/5=0.8.

A variety of techniques for FEC encoding and decoding are known. The combination of a FEC encoding technique and the corresponding FEC decoding technique are herein referred to as a “FEC scheme.” Stronger FEC schemes provide better protection (i.e., better error detection and correction) by adding more redundancy. However, this is at the expense of a lower information rate. Circuitry to implement stronger FEC schemes may also take up more space, may be more costly, and may produce more heat than circuitry to implement weaker (i.e., higher-rate) FEC schemes.

A FEC scheme may be implemented using hard decision FEC decoding or soft decision FEC decoding. In hard decision FEC decoding, using BPSK as an illustrative example, a firm decoding decision is made by comparing a received signal to a threshold; anything above the threshold is decoded as “1” and anything below the threshold is decoded as “0”. In soft decision FEC decoding, additional probability bits are used to provide a more granular indication of the received signal; in addition to determining whether the incoming signal is “1” or “0” based on the threshold, the soft decision FEC decoding also provides an indication of confidence in the decision. While soft decision FEC decoding is more robust than hard decision FEC decoding, it is also more complicated to implement.

A FEC scheme may be selected to satisfy a desired BER tolerance. For example, a hard decision FEC scheme may take input bits having a maximum BER of 10⁻⁴, (i.e., 1 bit error for each 10000-bit block), and may produce output bits having a maximum BER of 10⁻¹⁶ (10⁻¹² bit errors for each 10000-bit block). It is of interest to maximize the information rate, while satisfying a desired BER tolerance.

U.S. Pat. No. 9,537,608 describes a FEC technique referred to as staggered parity, in which parity vectors are computed such that each parity vector spans a set of frames; a subset of bits of each frame is associated with parity bits in each parity vector; and a location of parity bits associated with one frame in one parity vector is different from that of parity bits associated with the frame in another parity vector.

SUMMARY

This document proposes techniques for FEC with compression coding, which may provide higher information rates by reducing the proportion of redundant bits relative to information bits that are transmitted from a transmitter to a receiver.

In one example, at a transmitter end, a plurality of determiners are calculated from a set of information bits, where each determiner is calculated as a first function of a respective first subset of the information bits. A nub is then calculated as a second function of the plurality of determiners, where the nub comprises a number of redundant bits that is less than a number of bits comprised in the plurality of determiners. The set of information bits is transmitted to a receiver in a first manner, and the nub is transmitted to the receiver in a second manner, where the first manner is distinct from the second manner.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates a schematic representation of an example communications system configurable to implement techniques for Forward Error Correction (FEC) with compression coding;

FIG. 2 illustrates a schematic representation of redundancy included in the rows of a FEC product code, in accordance with prior art;

FIG. 3 illustrates a schematic representation of redundancy compressed into a nub, in accordance with an example of FEC with compression coding;

FIG. 4 illustrates a schematic representation of a first example of FEC with compression coding;

FIG. 5 illustrates a method for data transmission over one or more communications channels, in accordance with some examples of FEC with compression coding;

FIG. 6 illustrates a method for decoding information bits received over one or more communications channels, in accordance with some examples of FEC with compression coding;

FIG. 7 illustrates a schematic representation of a second example of FEC with compression coding;

FIG. 8 illustrates a method for data transmission over one or more communications channels, in accordance with some examples of FEC with compression coding; and

FIG. 9 illustrates a method for decoding information bits received over one or more communications channels, in accordance with some examples of FEC with compression coding.

DETAILED DESCRIPTION

A Forward Error Correction (FEC) scheme may be designed to tolerate input bits having a maximum input bit error ratio (BER) and to produce output bits having at most a maximum output BER, where the maximum output BER is adequate for a particular application.

U.S. patent application Ser. No. 15/672,434, filed on Aug. 9, 2017, describes techniques for FEC with contrast coding. Contrast coding may be used to tune the BERs experienced by different subsets of bits, relative to each other, to better match a plurality of FEC schemes. For example, contrast coding may be used to increase the BER of a first subset of bits relative to the BER of a second subset of bits. A strong FEC scheme (with a large amount of redundancy) may be applied to the first subset, and a high-rate FEC scheme (with a small amount of redundancy) may be applied to the second subset.

For a given FEC scheme, it may of interest to add as little overhead as possible to the payload during FEC encoding, thereby maximizing the information rate. In certain circumstances, it may be of interest to use hard decision FEC decoding, which is less complicated to implement than soft decision FEC decoding, and may therefore be less costly and produce less heat. Hard decision FEC decoding is typically performed using vector codes, such as Bose-Chaudhuri-Hocquenghem (BCH) codes, Reed-Solomon (RS) codes, Low-Density Parity Check (LDPC) codes, and other parity codes.

BCH coding involves a process of BCH encoding performed at a transmitter, and BCH decoding performed at a receiver. BCH encoding involves transforming a set of P information bits (also referred to as user bits or payload bits) into a BCH codeword C of length Q bits, where Q>P. The codeword C may be denoted by a sequence of bits (c1, c2, . . . , cN), which includes the P information bits as well as Q-P redundant bits. These Q-P redundant bits are what allows for the correction of errors introduced into the codeword C during transmission to a receiver. The redundant bits may be calculated to satisfy one or more constraints applied to the codeword C. As more constraints are applied to the codeword C, more redundant bits are included, and more error corrections are possible. For example, functions F₁ and F₂ may be defined that are each linear combinations of the bits of the codeword C, that is, F₁(C)=Σc₁ α₁ ^(i) and F₂(C)=Σc_(i) α₂ ^(i), where α₁ and α₂ are members of the Galois Field (GF) 2^(q), and where q is an arbitrary integer that depends on the length of BCH code. The Q-P redundant bits of the codeword C may be forced to have particular values that enable the codeword C to satisfy the constraints F₁(C)=V and F₂(C)=V, where V is a constrained value. The expressions F₁(C) and F₂(C) may also be referred to as syndromes of the codeword C. Typically, the redundant bits of the codeword are calculated by constraining one or more syndromes of the codeword C to zero, that is F₁(C)=0 and F₂(C)=0, but other constraints are possible. The constraint V that is applied to the syndromes is known at the receiver to which the BCH codeword C is transmitted. The example described above uses the convenient systematic formulation, wherein the information bits are transmitted unchanged and the redundant bits are grouped together at the end of the vector. As is well known in the art, there are also non-systematic formulations that satisfy the constraint by changing the values of information bits in specific ways or by including the required redundancy in various locations within the codeword C.

In the event that noise and/or distortion introduces errors during transmission from the transmitter to the receiver, the codeword Ĉ that is received will differ from the codeword C that was originally transmitted. The syndrome functions F₁(C) and F₂(C) are calculated on the received bits in the receiver. Calculated values other than V indicate the presence and location of bit errors. This indication is used by FEC decoding in its attempts to correct all of these bit errors and to not create new errors in the process.

One can consider the example in which one of the N bits of the received codeword C differs from the transmitted codeword C. This single bit error may be detected by calculating the syndrome of the received codeword Ĉ, that is F₁(Ĉ), and observing that F₁(Ĉ)≠V. Using the value of F₁(Ĉ), it may be possible to correct this error and not cause other errors. Additional bit errors might be corrected by calculating additional syndromes, such as F₂(Ĉ). In general, a BCH code that is capable of correcting t errors may be referred to as a t-error-correcting BCH code.

For moderate BER tolerances, such as 10⁻⁴, BCH coding can achieve high information rates as the length of the vector grows towards infinity. However, longer vectors require more corrections, thereby requiring an iterative decoding process that may incur unwanted time delays, more hardware complexity, and more heat. For example, performing the Berlecamp algorithm and Chien search may consume many clock cycles for large block lengths and large values oft. In applications such as 600 Gb/s optical signals, for example, it may be desirable to use fast and simple parallel hardware.

One technique for limiting the number of corrections required per BCH codeword is the use of a product code. In product coding, user bits may be transformed into a two-dimensional array, in which encoded bits are arranged into rows and columns, where each row is a codeword, and each column is also a codeword. In this manner, the same amount of user information may be encoded using multiple shorter-length codewords (each requiring fewer corrections), instead of a single lengthy codeword (requiring many corrections). Error correction of the product code at the receiver may be performed by alternating row decoding and column decoding, also referred to as two-iteration decoding.

U.S. Pat. No. 5,719,884 to Roth et al. describes an error correction method and apparatus based on a two-dimensional code array with reduced redundancy. As discussed in the background of Roth et al., in a typical product code encoder, a two-dimensional array is generated using two RS codes, where a first RS code C₁ is applied to the rows, and a second RS code C₂ is applied to the columns. Decoding of the product code may be performed by detecting errors using the code C₁, and correcting erasures using the code C₂. A traditional product code of this type may offer protection for both random errors and burst errors.

Roth et al. are concerned with the problem that, although the code C₁ is able to detect whether up to all rows of the array are corrupted, the code C₂ is only able to correct up to r₂ locations per column, where r₂ is the number of redundancy symbols in a column. Thus, information derived from the code C₁ about a combination of any more than r₂ corrupted rows is effectively useless to the erasure correction operation to be performed with the code C₂. The ability of the code C₁ to detect extra corrupted rows (which cannot be corrected with the code C₂) comes at a price of added redundancy, which serves no useful purpose if the corrupted rows cannot be corrected.

To address this problem, Roth et al. propose a method which eliminates the excess redundancy related to the unused error detection capability of the code C₁ by incorporating an intermediate code C_(1.5). According to the encoding method described with respect to FIG. 6 of Roth et al., the columns of a first raw data block D1 are encoded using an RS code C₂, thereby adding C₂ column code checks to the block D1. The result is combined with a smaller raw data block D2, and, in one example, the remaining area 168 of the two-dimensional array is filled with zeroes. Each row of this intermediate array is then encoded in an intermediate array buffer using an RS code C₁, which results in intermediate C₁ row code checks, which are split into two portions 170 and 171, where the portion 170 has dimensions corresponding to those of the block D2. Here, Roth et al. introduce the intermediate code C_(1.5) which, similarly to the codes C₁ and C₂, is also a RS code. The intermediate code C_(1.5) is applied to the intermediate C₁ row code checks portion 170, which results in an array 155 of C_(1.5) column code checks. The array 155 is combined with the intermediate C₁ row code checks portion 171 using an XOR adder, which yields the final row code checks 198. The row code checks 198 are included in the array 130, together with the data blocks D1, D2, and C₂ column code checks 160.

The methods disclosed by Roth et al. are specific to a two-dimensional product code array using RS encoders and decoders. The aim of Roth et al. is to provide a reduced redundancy product code that is able to maintain the same error correction capability as a traditional product code (including burst error protection using erasure correction). Roth et al. achieve this specific aim by using the intermediate RS code C_(1.5) to reduce the redundancy that is present in the rows of the two-dimensional product code array. In particular, Roth et al. disclose that, following the calculation of intermediate C₁ row code checks, the RS code C_(1.5) is applied to a first portion of the intermediate C₁ row code checks, which results in C_(1.5) column code checks, and then a second portion of the intermediate C₁ row code checks is added to the C_(1.5) column code checks in order to obtain the final row code checks 198 that are to be included in the product code array 130. When decoding, Roth et al. use the intermediate code C_(1.5) to identify which rows are erased, and then the code C₂ is used to fill in values for the erased rows.

According to the methods disclosed by Roth et al., the redundancy (constituted by the C₂ column code checks 160 and the row code checks 198) is always included as part of the product code array 130. Roth et al. only contemplate an intermediate code C_(1.5) that is designed to be a subcode of code C₂, such that code blocks of C_(1.5) contain the r₂ redundant check symbols computed as for C₂, plus an additional set of r₂ check symbols. In other words, a portion of the row code checks 198 is always equal to the corresponding column syndrome for code C₂. This places a constraint on the type of intermediate code C_(1.5) that can be used.

This document proposes techniques for FEC with compression coding. Similarly to traditional product codes, compression coding may offer an advantage over large-block BCH coding by using many short and relatively simple codes which can be error-corrected in parallel in fewer clock cycles, thereby allowing for a small and very fast hardware implementation, which may be important for chain decoding. However, the compression coding techniques described herein may offer an advantage over traditional product codes by reducing the amount of overhead that is needed to transmit user bits for a given BER tolerance. In one example, the compression coding techniques proposed herein may be used to implement high-rate FEC schemes suitable for use with the contrast coding techniques described in U.S. patent application Ser. No. 15/672,434, filed on Aug. 9, 2017. For example, contrast coding may steer most bit errors away from some of the bit streams, producing a requirement for a very high-rate FEC scheme that is able to take bits having a BER of 10⁻³ or 10⁴ and to output bits having a BER <10⁻¹⁶.

FIG. 1 illustrates a schematic representation of an example communications system 100 configurable to implement Forward Error Correction (FEC) with compression coding. The communications system 100 comprises a transmitter 101 and a receiver 103, the transmitter 101 being configured to transmit a signal 114 to the receiver 103 over one or more communications channels, where the signal 114 is representative of data to be communicated from the transmitter 101 to the receiver 103. The signal 114 may be transmitted optically, for example using optical fibers, or using other means of wired or wireless communications, with one or more carriers or baseband.

FIG. 1 is merely a schematic illustration. It should be understood that each of the transmitter 101 and the receiver 103 may be embodied by one or more electronic devices and may comprise additional hardware and/or software components that are not shown in FIG. 1. For example, each of the transmitter 101 and the receiver 103 may comprise memory, for example, in the form of a non-transitory computer-readable medium, which stores computer-executable instructions for performing the methods described herein, and one or more processors configurable to execute the instructions. The boxes illustrated in solid lines may be understood to represent computer-executable processes to be executed by the respective processors at the transmitter 101 and the receiver 103. More specifically, one or more processors at the transmitter 101 are configurable to execute code for implementing the processes of FEC encoding 104 and modulation 112, as will be described in more detail below. Similarly, one or more processors at the receiver 103 are configurable to execute code for implementing the processes of demodulation 116 and FEC decoding 124, as will be described in more detail below.

The signal 114 is representative of symbols to be transmitted from the transmitter 101 to the receiver 103, the symbols having been generated according to a particular modulation format defined by the modulation process 112 performed at the transmitter 101, and where each symbol represents a plurality of bits. The symbols, and estimates of the bits they represent, may be recoverable from the corresponding demodulation process 116 performed at the receiver 103, where the demodulation process 116 is the inverse of the modulation process 112. A bit estimate may comprise a binary value, or may comprise a confidence value, such as log-likelihood ratio. A log-likelihood ratio (LLR) is defined as the logarithm of the ratio of the probability of a bit being equal to zero to the probability of that bit being equal to one. For example, for a bit “b”,

${{{LLR}(b)} = {\log \frac{P\left( {b = 0} \right)}{P\left( {b = 1} \right)}}},$

where P denotes probability.

During its transmission from the transmitter 101 to the receiver 103, the signal 114 may experience noise and/or distortion, including contributions of noise and/or distortion from components of the transmitter 101 and receiver 103 themselves. The noise and/or distortion may lead to errors in the symbols recovered from the demodulation process 116, as well as errors in the bits represented by the symbols.

The processes of FEC encoding 104 and FEC decoding 124 are associated with a FEC scheme that involves compression coding, examples of which will be described throughout this document. FEC with compression coding may be understood by introducing the new terminology “determiner.” A determiner may be defined as a function of a sequence of bits. The function may comprise, for example, a polynomial function or a linear combination of the sequence of bits. A syndrome F(C) of a BCH codeword C may be considered an example of a determiner. However, whereas a syndrome of an error-free codeword is typically constrained to have a particular value that is known in advance to the receiver, such as zero, a determiner may be permitted to have an arbitrary value that is unknown to the receiver.

Given a set of transmitted bits comprising subsets arranged as vectors, a determiner may be considered as a T-bit algebraic syndrome of one of those vectors, where T is an integer greater than four, for example, where the determiner assumes more than T different values as a function of the values of the bits in the vector, and where the determiner is disjoint with the set of transmitted bits.

As previously described, a traditional product code involves the transmitter calculating a syndrome of each row of bits (as well as a syndrome of each column of bits), where each syndrome is constrained to have a known value, such as zero, which is shared with the receiver. In order to satisfy the constraints placed on the syndromes, a portion of the bits in each row and each column are forced to have particular values. These redundant bits are transmitted together with the information bits to the receiver, where they are used to perform error detection and correction.

FIG. 2 illustrates a schematic representation of the redundant bits that might be included in each row of a traditional product code array, according to prior art. For example, in row 1, vector 1 represents the information bits (payload bits), while redundant bits 1 represents the bits that are included to satisfy the constraint: syndrome (row 1)=0. Similarly, in row 2, vector 2 represents the information bits, while redundant bits 2 represents the bits that are included to satisfy the constraint: syndrome (row 2)=0. In this manner, each of the K rows would include the redundant bits needed to satisfy the constraint placed on the syndrome of the respective row. Although not explicitly illustrated, similar constraints would be applied to each column, thereby resulting in additional redundant bits in the columns. The presence of these redundant bits limits the amount of information bits that can be transmitted in an array, which in turn limits the information rate that is achievable with a traditional product code.

According to examples of the technology proposed in this document, instead of constraining the syndrome of each row (and each column) in a product code to have a known value, thereby requiring the presence of redundant bits in each row (and each column), a determiner may be calculated for each row (and each column), where the determiner is not constrained to have a particular value. A determiner may be calculated as a function of a subset of information bits along a particular dimension, such as a row or a column, for example. For example, as illustrated in FIG. 3, in the case of an array with K rows of information bits, a sequence of K determiners is calculated, where K is an integer greater than four. Each determiner is permitted to have an arbitrary value of length T bits, where T is an integer greater than four, for example. Each determiner may consist of single bits or one or more multi-bit symbols. Because there is no constraint placed on the value of a given determiner, there is no need to include redundant bits in the row from which that determiner is calculated. Instead, the FEC redundancy is determined by applying a constraint to the sequence of K determiners. In other words, FEC encoding may be applied to the K determiners, thereby generating the redundancy needed to satisfy the constraint applied to the sequence of K determiners. This redundancy may be defined using the new terminology “nub.” A redundant nub may be calculated as a function of a set of determiners. The nub may consist of single bits, or one or more multi-bit symbols. It is this nub that is transmitted, in addition to the array of K rows of information bits, to the receiver. The K determiners are used in the calculation of the nub, but they are not themselves transmitted to the receiver.

For some applications, it may be of interest to transmit the nub in a manner that is distinct or disjoint from the information bits. For example, the systematic bits may have different properties than the bits of the nub, and accordingly it may be of interest to treat their respective transmissions differently. In other words, the information bits may be transmitted in a first manner over one or more communications channels, and the nub may be transmitted in a second manner over the one or more communications channels, where the first manner is distinct from the second manner. In some examples, the first manner may be distinguished from the second manner by transmission over different communications channels, which may include, for example, performing separate transmissions over separate communications interfaces of a transmitting electronic device. In some examples, the first manner may be distinguished from the second manner by employing different aspects of a modulation format. For example, 4-PAM with Gray labeling inherently produces bits having different BERs, where the least significant bit (LSB) has a BER that is twice that of the most significant bit (MSB). Depending on the application, the nub bits could be encoded as the LSBs, and the information bits could be encoded as the MSBs, or vice versa. In some examples, the first manner may be distinguished from the second manner by employing different FEC encoding schemes. In some examples, the nub may be inserted directly, without alteration or modification, into a structure comprising the information bits, such as a multi-dimensional array. In some examples, the nub may be logically a portion of a rectangular array comprising the set of information bits.

Following receipt of the nub and the array of bits from the transmitter, the receiver may then perform its own calculation of the K determiners from the received array. The receiver may then use the K calculated determiners to perform its own calculation of the nub. In the event that the calculated nub does not match the nub that was received from the transmitter, the receiver may determine that there is an error in one of the determiners, which means that there is an error in the row of bits from which that determiner was calculated. A comparison of the calculated nub to the received nub may allow the receiver to determine which of the K calculated determiners is incorrect, and also to determine the correct value of that determiner. The receiver may then be able to use the difference between the calculated value of the determiner and the correct value of the determiner to identify which bit of the corresponding row of the array is incorrect, and to correct the error.

Although not explicitly illustrated in FIG. 3, similarly to the manner in which the determiners of the rows may be compressed into a nub, it is also possible to calculate determiners of columns, and to compress those determiners into another nub. More generally, a first set of determiners could be calculated in a first dimension and compressed into a first nub, and a second set of determiners could be calculated in a second dimension and compressed into a second nub. At a receiver, the first nub could be used to decode the first set of determiners, and the second nub could be used to decode the second set of determiners, where the first set of determiners apply to a first set of received bits and the second set of determiners apply to a second set of received bits, and where an intersection of the first set and the second set comprises at least one bit. In some examples, the first dimension may be substantially orthogonal to the second dimension. In some examples, determiners could be calculated along one or more additional dimensions, such as diagonally. The calculation of determiners in multiple dimensions may increase the minimum Hamming distance and the error-correcting capability of the compression code. Where the same polynomial is used for calculating the determiners as for compressing along that same dimension to the nub, both nubs will be identical, and there will accordingly be no redundancy cost for performing compression along the second dimension.

In contrast to a traditional product code, in which each row (and each column) of the transmitted array comprises redundant bits, the array that is transmitted using FEC with compression coding need not comprise any redundant bits. Instead, the redundancy is compressed into the nub(s), which can be transmitted outside of the array (i.e., disjoint from the array), and which may be significantly smaller in size than the redundancy that would be present in the rows and columns of a traditional product code array. This is demonstrated schematically by a visual comparison of FIG. 2 to FIG. 3. The proportion of transmitted bits that are information bits (i.e., vectors 1, 2, 3, . . . , K) is higher in FIG. 3, when the redundancy is transmitted in the form of the compressed nub, than in FIG. 2, when the redundancy is transmitted in the form of redundant bits in each row. By increasing the proportion of transmitted bits that are information bits, FEC with compression coding may provide an increased information rate for a given BER tolerance.

FIG. 4 illustrates a schematic representation of a first example of FEC with compression coding. In this example, a set of information bits is arranged at a transmitter into a two-dimensional array consisting of five vectors, where each vector has a length of 64 bits. The information bits in the array are to be encoded at the transmitter for transmission over one or more communications channels to a receiver.

Compression coding is performed by calculating at the transmitter a determiner for each vector. In this example, each determiner is calculated as a 1-error-correcting BCH polynomial residue having a length of T=6 bits. With standard binary BCH coding, in systematic form, each residue would be appended as redundant bits to the respective vector, so as to form a valid BCH codeword having a syndrome of zero, and the five BCH codewords would be transmitted to the receiver. However, with compression coding, the residues are defined as determiners which are not actually transmitted to the receiver. Instead, FEC encoding is applied to the sequence of determiners, thereby generating a nub. The nub is effectively a compressed version of the redundancy which is transmitted with the information bits in order to allow for error correction at the receiver.

In this example, the FEC encoding of the determiners is performed using an RS polynomial with 6-bit symbols (i.e., an RS-6 code), which results in the calculation of a nub in the form of RS parity symbols. For every 2t parity symbols, an RS code can correct up to t symbols. In other words, two RS parity symbols would be needed to correct a single symbol error. In this example, the nub consists of the two RS parity symbols calculated from the set of five determiners. The five vectors of information bits and the nub are transmitted to the receiver.

In this example, the nub consists of two 6-bit symbols and therefore has a total size of 2×6=12 bits. In contrast, the sequence of five determiners, each of which consists of one 6-bit symbol, would have a total size of 5×6=30 bits. Thus, using compression coding and transmitting the nub may result in the transmission of fewer redundant bits relative to what would be transmitted with standard BCH coding. As the number K of determiners increases, for example, K>4, the nub may comprise far fewer bits than the K determiners. A lower proportion of redundant bits in a transmission means a higher information rate.

For simplicity, it is assumed in this example that one of the five vectors received at the receiver contains a single error introduced during transmission. The received vectors and the received nub may be used at the receiver to identify and correct this error. First, for each received vector, a corresponding determiner is calculated. Similarly to the calculation performed at the transmitter, in this example, the receiver calculates for each received vector a 1-error-correcting BCH polynomial residue. For clarity, these calculated residues may be referred to as “receiver-calculated determiners” in order to distinguish them from the original determiners calculated at the transmitter (i.e., the true, correct determiners). As a result of the single error contained in one of the received vectors, it follows that one of the receiver-calculated determiners will be incorrect (i.e., will not match the original determiner that was calculated at the transmitter). As previously noted, the received nub consists of two RS parity symbols, which permits the correction of a single symbol error. Thus, the receiver may correct the single determiner error by apply RS FEC correction to the set of receiver-calculated determiners and the received nub. The RS FEC correction would result in a vector consisting of the five FEC-corrected determiners and the FEC-corrected nub. By noting which determiner was corrected, or by comparing the five FEC-corrected determiners to the receiver-calculated determiners, the receiver is able to identify which one of the five receiver-calculated determiners is incorrect, and thus which one of the five vectors contains the single bit error. By subtracting modulo 26=64 the FEC-corrected determiner from the erroneous receiver-calculated determiner, an error indication may be produced for that vector, and standard BCH error correction may be used to correct the single bit error.

FIG. 5 illustrates a method for data transmission over one or more communications channels, in accordance with some examples of FEC with compression coding, such as those illustrated in FIG. 3 and FIG. 4.

At 500, a calculation is made at a transmitter based on a set of information bits to be encoded for transmission over one or more communications channels to a receiver. The set of information bits may be divided along one dimension into K subsets, where K is an integer greater than four. For example, each subset may consist of a distinct row of a two-dimensional array of information bits. For each subset, a determiner is calculated, where the determiner is a function of the bits in the subset and has a length of T bits, where T is an integer greater than four, for example. Each determiner may consist of single bits or one or more multi-bit symbols. These calculations result in a sequence of K determiners. Similar calculations may be made for determiners in one or more additional dimensions.

At 502, a nub is calculated at the transmitter by applying FEC encoding to the K determiners. The nub comprises redundant bits or symbols which, when appended to the K determiners, satisfy a constraint of the FEC encoding. The nub may have a length N−K, such that the total length of the determiners and the nub is N, where N>K. One or more additional nubs may be calculated in a similar manner in the event that determiners were calculated in one or more additional dimensions at 500.

At 504, the nub(s) and the set of information bits are transmitted over one or more communications channels to a receiver. In some examples, the nub(s) may be transmitted in a manner that is distinct or disjoint from the information bits. In some examples, the nub(s) and the information bits may be transmitted over different communications channels. In some examples, the nub(s) and the information bits may be transmitted using different aspects of one or more modulation formats, for example, such that they experience different BERs. In some examples, the information bits and the bits that form part of the nub(s) may undergo different FEC encoding schemes. In some examples, the nub(s) may be inserted directly, without alteration or modification, into a structure comprising the information bits, such as a multi-dimensional array. In some examples, the nub may be logically a portion of a rectangular array comprising the set of information bits.

FIG. 6 illustrates a method for decoding information bits received over one or more communications channels, in accordance with some examples of FEC with compression coding, such as those illustrated in FIG. 3 and FIG. 4.

At 600, a set of information bits and at least one nub are received at a receiver over one or more communications channels. The nub may have a length N−K, while the received set of information bits is divisible along one dimension into K subsets, where K>4 and N>K.

At 602, a calculation of K receiver-calculated determiners is made at the receiver based on the received set of information bits. Each receiver-calculated determiner may be a linear function of a respective one of the K subsets of received information bits and may have a length of T bits, where T is an integer greater than four, for example. Each receiver-calculated determiner may consist of single bits or one or more multi-bit symbols. These calculations result in a sequence of K receiver-calculated determiners. Additional receiver-calculated determiners may be calculated in one or more additional dimensions in a similar manner.

At 604, FEC decoding is applied to the K receiver-calculated determiners and the received nub. This FEC decoding results in K FEC-corrected determiners and a FEC-corrected nub.

At 606, the receiver calculates the difference between the K FEC-corrected determiners and the K receiver-calculated determiners. For example, the FEC-corrected determiners may be subtracted from the receiver-calculated determiners, which will generate an error syndrome for each receiver-calculated determiner.

At 608, the receiver may use the difference calculated at 606 to correct at least one error in the received set of information bits. For example, from each non-zero error syndrome, it may be possible to determine the location of at least one error within the corresponding subset (i.e., vector), and to correct the error.

Although not explicitly illustrated, the preceding examples may be extended to a t-error-correcting BCH code, where t>1, thereby resulting in t determiners per vector. In one example, each of the t columns of determiners could be compressed to a separate nub.

Rather than transmitting each of a plurality of nubs to the receiver, one or more of the nubs may be treated as intermediate non-transmitted nubs that are compressed into one or more nubs that are actually transmitted. This may be achieved using a series of FEC encoding stages, as will be described in the following example. While this additional compression may lower the BER tolerance, it may provide the advantage of significantly reducing the amount of redundancy transmitted in the compression code, thereby increasing the information rate.

FIG. 7 illustrates a schematic representation of a second example of FEC with compression coding. In this example, compression of the redundancy is achieved using a series of FEC encoding stages.

In a first stage, a first set of information bits, denoted as SET 1, comprises K₁ subsets, where each subset has a length of X₁. For ease of explanation, SET 1 in this example is arranged into a two-dimensional array, where each of the K₁ subsets comprises a different row of the array, and where each row has a length of X₁ bits. For each of the K₁ rows, a first determiner is calculated, thereby resulting in a sequence of K₁ first determiners, denoted as D₁. The calculation of the first determiners may be denoted as D₁(i)=d₁(SET1(i)), for i=1 . . . K₁, where d₁ denotes a first function that is dependent on the bits of row i. FEC encoding using a first FEC scheme F1 may be applied to the first determiners D₁, which results in a set of N−K₁ redundant bits, denoted as a first intermediate nub R₁. The first FEC scheme F1 may be relatively strong, thereby resulting in the first intermediate nub R₁ being relatively large in size (i.e., adding a significant amount of redundancy to the first determiners D₁ in order to satisfy the requirements of the first FEC scheme F1).

A second set of information bits, denoted as SET 2, comprises K₂−K₁ subsets, where each subset has a length of X₂, and where X₂<X₁. SET 2 in this example is arranged into a two-dimensional array, where each of the K₂−K₁ subsets comprises a different row of the array, and where each row has a length of X₂ bits. The K₂−K₁ rows of SET 2 follow the K₁ rows of SET 1, such that the first row of SET 2 may be denoted as row K₁+1 and the last row of SET 2 may be denoted K₂. A set of redundant values, denoted as redundancy A₁, may be appended to the SET 2.

However, rather than calculating the redundancy A₁ such that it satisfies the constraint that the syndrome of each of rows K₁+1 . . . K₂ has a value of zero, in this example, the redundancy A₁ may instead be calculated to satisfy the constraint that the first determiner d₁ of each of these rows has a value taken from the first intermediate nub R₁. For example, the redundancy A₁(1) appended to the first row of SET 2 (i.e., row K₁+1 overall) may be calculated such that the first determiner d₁ of row K₁+1 is equal to the first value of the first intermediate nub, that is D₁(row K₁+1)=R₁(1). In general, the redundancy A₁(i) may be calculated so as to satisfy the relationship: D₁(row K₁+i)=R₁(i), for i=1 . . . K₂−K₁. This relationship uniquely determines the values of redundancy A₁(i).

Together, SET 1 and SET 2 of information bits and redundancy A₁, consist of K₂ rows, each row having a length of X₁ bits. In a second stage of FEC encoding, for each of these K₂ rows, a second determiner is calculated, thereby resulting in a sequence of K₂ second determiners, denoted as D₂. The calculation of the second determiners may be denoted as D₂(i)=d₂(row i), for i=1 . . . K₂, where d₂ denotes a second function that is dependent on the bits of row i. As an example, functions d₁ and d₂ may be defined that are each linear combinations of the bits of each row, that is, d₁(row i)=Σb_(ik) α₁ ^(k) and d₂(row i)=Σb_(ik) α₂ ^(k), where α₁ and α₂ are members of a Galois Field (GF) of proper size, and where b_(ik), 1≤k≤X₁, are bits of row i. FEC encoding using a second FEC scheme F2 may be applied to the second determiners D₂, which results in a set of N−K₂ redundant bits, denoted as a second intermediate nub R₂. The second FEC scheme F2 may provide less protection than the first FEC scheme F1, thereby resulting in the second intermediate nub R₂ being smaller in size than the first intermediate nub R₁, as illustrated in FIG. 7.

A third set of information bits, denoted as SET 3, comprises K₃−K₂ subsets, where each subset has a length of X₃, and where X₃<X₂. SET 3 in this example is arranged into a two-dimensional array, where each of the K₃−K₂ subsets comprises a different row of the array, and where each row has a length of X₃ bits. The K₃−K₂ rows of SET 3 follow the K₂ rows of SET 1 and SET 2, such that the first row of SET 3 may be denoted as row K₂+1 and the last row of SET 3 may be denoted K₃. Two sets of redundant values, denoted as redundancy B₁ and redundancy A₂, respectively, may be appended to SET 3. The redundancy B₁ and the redundancy A₂ may be calculated to satisfy two constraints: (1) the first determiner D₁ of each of these rows may have a value from the first intermediate nub R₁; and (2) the second determiner D2 of each of these rows may have a value from the second intermediate nub R₂. For example, the redundancy B₁(1) and the redundancy A₂(1) appended to the first row of SET 3 (i.e., row K₂+1 overall) may be calculated such that D₁(row K₂+1)=R₁(K₂−K₁+1) and such that D₂(row K₂+1)=R₂(1). In general, the redundancy B₁(i) and the redundancy A₂(i) may be calculated so as to satisfy the following two constraints: (1) D₁(row K₂+1)=R₁(K₂−K₁+i) and (2) D₂(row K₂+i)=R₂(i), for i=1 . . . K₃−K₂. These two constraints uniquely determine values of redundancies B₁(i) and A₂(i). As illustrated in FIG. 7, because more constraints are placed on rows K₂+1 to K₃, (relative to rows K₁+1 to K₂), these rows contain more redundancy.

Together, SET 1, SET 2 and SET 3 of information bits and redundancy A₁, B₁, and A₂ consist of K₃ rows, each row having a length of X₁ bits. In a third stage of FEC encoding, for each of these K₃ rows, a third determiner is calculated, thereby resulting in a sequence of K₃ third determiners, denoted as D₃. The calculation of the third determiners may be denoted as D₃(i)=d₃(row i), for i=1 . . . K₃, where d₃ denotes a third function that is dependent on the bits of row i. As an example, functions d₁, d₂, and d₃ may be defined that are each linear combinations of the bits of each row, that is, d₁(row i)=Σb_(ik) α₁ ^(k,) d₂(row i)=Σb_(ik) α₂ ^(k) and d₃(row i)=Σb_(ik) α₃ ^(k) where α₁, α₂, and α₃ are members of a Galois Field (GF) of proper size, and where b_(ik), 1≤k≤X₁, are bits of row i. FEC encoding using a third FEC scheme F3 may be applied to the third determiners D₃, which results in a set of N−K₃ redundant bits, denoted as a third intermediate nub R₃. The third FEC scheme F3 may provide less protection than the FEC schemes F1 and F2, thereby resulting in the third intermediate nub R₃ being smaller in size than the first and second intermediate nubs R₁ and R₂.

A fourth set of information bits, denoted as SET 4, comprises N−K₃ subsets, where each subset has a length of X₄, and where X₄<X₃. SET 4 in this example is arranged into a two-dimensional array, where each of the N−K₃ subsets comprises a different row of the array, and where each row has a length of X₄ bits. The N−K₃ rows of SET 4 follow the K₃ rows of SET 1, SET 2 and SET 3, such that the first row of SET 4 may be denoted as row K₃+1 and the last row of SET 4 may be denoted N. Three sets of redundant values, denoted as redundancy C₁, redundancy B₂, and redundancy A₃, may be appended to SET 4. The redundancies C₁, B₂, and A₃ may be calculated to satisfy three constraints: (1) the first determiner d₁ of each of these rows may have a value from the first intermediate nub R₁; the second determiner d₂ of each of these rows may have a value from the second intermediate nub R₂; and (3) the third determiner d₃ of each of these rows may have a value from the third intermediate nub R₃. For example, the redundancies C₁(1), B₂(1), and A₃(1) appended to the first row of SET 4 (i.e., row K₃+1 overall) may be calculated such that D₁(K₃+1)=R₁(K₃−K₁+1) and such that D₂(row K₃+1)=R₂(K₃−K₂+1) and such that D₃(row K₃+1)=R₃(1). In general, the redundancies C₁(i), B₂(i) and A₃(i) may be calculated so as to satisfy the following three constraints: (1) D₁(row K₃+i)=R₁(K₃−K₁+i); (2) D₂(row K₃+i)=R₂(K₃−K₂+i); and (3) D₃(row K₃+i)=R₃(i), for i=1 . . . N−K₃. These three constraints uniquely determine values of redundancies C₁(i), B₂(i) and A₃(i). As illustrated in FIG. 7, because more constraints are placed on rows K₃+1 to N, (relative to rows K₁+1 to K₂ and rows K₂+1 to K₃), these rows contain the most redundancy.

According to this example, what is transmitted to the receiver is an array consisting of N rows, each having a length of X₁ bits. The first K₁ rows consist solely of information bits (SET 1); the next K₂−K₁ rows consist of information bits (SET 2) and redundancy A₁; the next K₃−K₂ rows consist of information bits (SET 3) and redundancy B₁ and A₂; and the final N−K₃ rows consist of information bits (SET 4) and redundancy C₁, B₂, and A₃. The redundancy added by the FEC schemes F1, F2, and F3 is effectively compressed into redundancies A₁, A₂, A₃, B₁, B₂, and C₁. Redundancies A₁, A₂, and A₃ may be understood as corresponding to a first transmitted nub; redundancies B₁ and B₂ may be understood as corresponding to a second transmitted nub; and redundancy C₁ may be understood as corresponding to a third transmitted nub. The determiners D₁, D₂, and D₃, and the intermediate nubs R₁, R₂, and R₃ are not actually transmitted to the receiver, but are used in the compression of the redundancy.

Error detection and correction may be performed at the receiver in stages, corresponding to the stages used to compress the redundancy at the transmitter. The functions d₁, d₂, and d₃ are shared between the transmitter and the receiver, such that the receiver may employ the same functions to calculate the first, second, and third determiners, respectively, which may be used to detect and correct errors in the receiver data.

In a first stage, for each of the N received rows, a receiver-calculated first determiner may be calculated, thereby resulting in N receiver-calculated first determiners. FEC decoding corresponding to the first FEC scheme F1 may be applied to the N receiver-calculated first determiners in order to obtain N FEC-corrected first determiners. Upon comparing the N FEC-corrected first determiners to the N receiver-calculated first determiners, the receiver may identify rows that contain bit errors. A 1-error-correcting BCH code may be used to correct a single error per row.

After performing corrections based on FEC-correction of the first determiners, errors may still remain. A second stage of error correction may be used to correct at least some of these errors. In this second stage, for the N rows that have already undergone the first stage of FEC-correction, N receiver-calculated second determiners may be calculated. FEC decoding corresponding to the second FEC scheme F2 may be applied to the N receiver-calculated second determiners in order to obtain N FEC-corrected second determiners. A comparison of the N FEC-corrected second determiners to the N receiver-calculated second determiners may permit the receiver to identify and correct at least some of the remaining bit errors that were not corrected during the first stage.

In a third stage of error correction, for the N rows that have already undergone the first and second stages of FEC-correction, N receiver-calculated third determiners may be calculated. FEC decoding corresponding to the third FEC scheme F3 may be applied to the N receiver-calculated third determiners in order to obtain N FEC-corrected third determiners. A comparison of the N FEC-corrected third determiners to the N receiver-calculated third determiners may permit the receiver to identify and correct at least some of the remaining bit errors that were not corrected during the first and second stages.

The N received rows that undergo the first stage of FEC decoding may have a large number of bit errors. It is for this reason that that the first FEC scheme F1 may be very strong, so as to correct as many errors as possible in the first stage. For each subsequent stage of error correction, the number of errors remaining in the N rows is expected to decrease. Accordingly, the overhead of the FEC schemes F2 and F3 may drop rapidly. Since only a small number of the N rows would require a large number of corrections, significant power savings may be achieved using this multi-stage coding strategy.

FIG. 8 illustrates a method for data transmission over one or more communications channels, in accordance with some examples of FEC with compression coding, such as that illustrated in FIG. 7.

At 800, a calculation is made at a transmitter based on a first set of information bits to be encoded for transmission to a receiver. The first set of information bits may be divided along a particular dimension into K₁ first subsets, where K₁ is an integer greater than four, for example. In one example, each first subset may consist of a distinct row of a two-dimensional array of information bits. For each first subset, a first determiner may be calculated, where the first determiner is a function of the bits in the first subset and has a length of T₁ bits, where T₁ is an integer greater than four, for example. Each first determiner may consist of single bits or one or more multi-bit symbols. These calculations result in a sequence of K₁ first determiners.

At 802, a first intermediate nub is calculated at the transmitter by applying a first FEC encoding scheme to the K₁ first determiners, which results in N−K₁ redundancy values, where N>K₁. These N−K₁ redundancy values, which may comprise bits or symbols, constitute the first intermediate nub. When appended to the K₁ first determiners, the first intermediate nub satisfies a constraint of the first FEC encoding scheme.

At 804, a first portion of a first transmitted nub is calculated at the transmitter based on the first intermediate nub and a second set of information bits to be encoded for transmission to a receiver. The second set of information bits may be divided into K₂−K₁ second subsets along the same particular dimension as the first set of information bits, where K₂>K₁. Each second subset is shorter in length than each first subset by a length equivalent to the length of each first determiner. The first portion of the first transmitted nub may be determined by calculating the redundancy which, when appended to the K₂−K₁ second subsets, would satisfy the requirement that the first determiners of the K₂−K₁ second subsets, together with their respective redundancies, are equal to corresponding values from the first intermediate nub.

In the event that N=K₂, the first portion of the first transmitted nub is also the last portion (i.e., the only portion). All N−K₁ values of the first transmitted nub would be calculated as the sum of all N−K₁ values of the intermediate nub and the syndromes of the N−K₁ second subsets. In this case, the method would proceed to step 812, where the first set of information bits, the second set of information bits, and the first transmitted nub would be transmitted to the receiver.

In the event that N>K₂, the method may proceed to step 806.

At 806, a calculation is made at the transmitter based on the first set of information bits, the second set of information bits, and the first portion of the first transmitted nub. For each first subset and for each second subset (plus its respective redundancy, as calculated at 804), a second determiner may be calculated, where the second determiner is a function of the bits to which the function is applied and has a length of T₂ bits, where T₂ is an integer greater than four, for example. Each second determiner may consist of single bits or one or more multi-bit symbols. These calculations result in a sequence of K₂ second determiners.

At 808, a second intermediate nub may be calculated at the transmitter by applying a second FEC encoding scheme to the K₂ second determiners, which results in N−K₂ redundancy values, where N>K₂. These redundancy values, which may comprise bits or symbols, constitute the second intermediate nub. When appended to the K₂ second determiners, the second intermediate nub satisfies a constraint of the second FEC encoding scheme. The second FEC encoding scheme provides less protection than the first FEC encoding scheme.

At 810, a second portion of the first transmitted nub and a first portion of a second transmitted nub are calculated at the transmitter based on the first intermediate nub, the second intermediate nub, and a third set of information bits to be encoded for transmission to a receiver. The third set of information bits may be divided into K₃−K₂ third subsets along the same particular dimension as the first and second sets of information bits, where K₃>K₂. Each third subset is shorter in length than each second subset by a length equivalent to the length of each second determiner. The second portion of the first transmitted nub and the first portion of the second transmitted nub may be determined by calculating the redundancy which, when appended to the K₃−K₂ third subsets, would satisfy the requirements that: (1) the first determiners of the K₃−K₂ third subsets, together with their respective redundancies, are equal to corresponding values from the first intermediate nub; and (2) the second determiners of the K₃−K₂ third subsets, together with their respective redundancies, are equal to corresponding values from the second intermediate nub.

In the event that N=K₃, the second portion of the first transmitted nub is also the last portion (i.e., the first transmitted nub contains only two portions), while the first portion of the second transmitted nub is also the last portion (i.e., the second transmitted nub contains only one portion). In this case, the method may proceed to step 812, where the first set of information bits, the second set of information bits, the third set of information bits, the first transmitted nub, and the second transmitted nub would be transmitted to the receiver.

In the event that N>K₃, prior to proceeding to step 812, the actions performed at 806, 808, and 810 could be repeated for the calculation of one or more additional sets of determiners and one or more additional intermediate nubs, which could be used in the encoding of one or more additional sets of information bits. This would result in additional portions being added to the existing transmitted nubs, as well as the generation of one or more additional transmitted nubs. Each set of determiners could be encoded using a progressively higher-rate FEC scheme, thereby resulting in transmitted nubs of progressively smaller size.

At 812, one or more sets of information bits and one or more transmitted nubs may be transmitted over one or more communications channels to the receiver. The one or more intermediate nubs are not transmitted, but are instead used to calculate the transmitted nubs, which provides for even more compression of the redundancy.

FIG. 9 illustrates a method for decoding information bits received over one or more communications channels, in accordance with some examples of FEC with compression coding, such as that illustrated in FIG. 7.

At 900, one or more sets of information bits and one or more nubs are received over one or more communications channels at a receiver. Together, the sets of information bits and the one or more nubs may be divisible along a particular dimension into N subsets, where N is an integer greater than four, for example. In one example, each subset might consist of a distinct row of a two-dimensional array formed from the sets of information bits and the one or more nubs.

At 902, a calculation of N receiver-calculated first determiners may be made at the receiver based on the respective N subsets. Each receiver-calculated first determiner is a function of the bits to which the function is applied, and has a length of T₁ bits, where T₁ is an integer greater than four, for example. Each receiver-calculated first determiner may consist of single bits or one or more multi-bit symbols. These calculations result in a sequence of N receiver-calculated first determiners.

At 904, first FEC decoding may be applied to the N receiver-calculated first determiners and a first received nub. This first FEC decoding results in N FEC-corrected first determiners and a FEC-corrected first nub.

At 906, the receiver may calculate the difference between the N receiver-calculated first determiners and the N FEC-corrected first determiners. For example, the N FEC-corrected first determiners may be subtracted from the N receiver-calculated first determiners, which will generate an error syndrome for each receiver-calculated first determiner.

At 908, the receiver may use the difference calculated at 906 to correct at least one error in the received sets of information bits. For example, from each non-zero error syndrome, it may be possible to determine the location of at least one error within the corresponding subset, and to correct the error.

Steps 902, 904, 906, and 908 may be repeated for one or more additional sets of determiners, as denoted at 910. For example, N receiver-calculated second determiners could be calculated using the received information bits and the one or more received nubs. Second FEC decoding could be applied to the N receiver-calculated second determiners and a second received nub to obtain N FEC-corrected second determiners. The receiver could then correct at least one additional error in the received information bits using the N FEC-corrected second determiners and the N receiver-calculated second determiners.

Because the first determiners will have been encoded using the strongest FEC encoding scheme, a significant number of errors may be correcting using the FEC-corrected first determiners. The subsequent sets of determiners (i.e., second, third, etc.) will have been encoded using successively higher-rate FEC encoding schemes, and accordingly the resulting sets of FEC-corrected determiners may result in successively fewer error corrections.

Numerous variations of the above examples are contemplated.

In some examples, FEC codes other than BCH and RS may be used. In one example, a Golay code could be used for 50% compression. However, multi-bit symbol error tolerance may be desirable for compression since each bit error in a vector is expected to flip half of the bits of the corresponding determiners. In some examples, RS coding could be used to create some or all of the determiners, with multi-bit symbols. For example, RS-8 uses 8-bit symbols. According to some examples, the new modal-decoded GLDPC code could be used for compressing the first nub because of its high tolerance to multiple symbol errors.

In some examples, iterative decoding may be used at the receiver. In some examples, soft decoding may be used in part or all of the error correction calculations.

In some examples, one or more first determiners for each vector may be transmitted instead of being compressed to one or more nubs, and only the later determiners may be compressed. Portions of determiners may be transmitted as well as or instead of being compressed.

In some examples, a nub may receive additional protection from other FEC outside of this block, or be transmitted or coded in a manner that is distinct from substantially all of the information bits.

In some examples, multiple types of determiners may be compressed together into various shapes of nub.

In some examples, multiple determiners from the same vector may be treated as one large symbol for the compression.

The preceding examples have involved compression coding in one or two dimensions. However, it is contemplated that the principles of compression coding may be extended to a third or greater dimension. In three-dimensional compression coding, determiners of determiners may be compressed along a third dimension and transmitted to a receiver. 

What is claimed is:
 1. A method of transmission over one or more communications channels, the method comprising: calculating a plurality of determiners from a set of information bits, wherein each determiner is calculated as a first function of a respective first subset of the information bits along a first dimension, and wherein the plurality is an integer greater than four; calculating, as a second function of the plurality of determiners, a nub comprising a number of redundant bits, wherein the number of the redundant bits is less than a number of bits comprised in the plurality of determiners; and transmitting the set of information bits in a first manner over the one or more communications channels; and transmitting the nub in a second manner over the one or more communications channels, wherein the first manner is distinct from the second manner.
 2. The method as claimed in claim 1, wherein the first manner is distinguished from the second manner by transmitting over different communications channels.
 3. The method as claimed in claim 1, wherein the first manner is distinguished from the second manner by employing different aspects of a modulation format.
 4. The method as claimed in claim 1, wherein the first manner is distinguished from the second manner by employing different forward error correction (FEC) encoding schemes.
 5. The method as claimed in claim 1, wherein the nub is logically a portion of a rectangular array comprising the set of information bits.
 6. The method as claimed in claim 1, wherein each determiner consists of one or more single bits calculated using a binary Bose-Chaudhuri-Hocquenghem (BCH) code.
 7. The method as claimed in claim 1, wherein the nub is calculated using a Reed-Solomon code.
 8. An electronic device comprising: a processor; and a memory storing computer-executable instructions which, when executed by the processor, cause the electronic device: to calculate a plurality of determiners from a set of information bits, wherein each determiner is calculated as a first function of a respective first subset of the information bits along a first dimension, and wherein the plurality is an integer greater than four; to calculate, as a second function of the determiners, a nub comprising a number of redundant bits, wherein the number of the redundant bits is less than a number of bits comprised in the plurality of determiners; and to transmit the set of information bits in a first manner over the one or more communications channels; and to transmit the nub in a second manner over the one or more communications channels, wherein the first manner is distinct from the second manner.
 9. The electronic device as claimed in claim 8, wherein the first manner is distinguished from the second manner by transmitting over different communications channels.
 10. The electronic device as claimed in claim 8, wherein the first manner is distinguished from the second manner by employing different aspects of a modulation format.
 11. The electronic device as claimed in claim 8, wherein the first manner is distinguished from the second manner by employing different forward error correction (FEC) encoding schemes.
 12. The electronic device as claimed in claim 8, wherein the nub is logically a portion of a rectangular array comprising the set of information bits.
 13. The electronic device as claimed in claim 8, wherein each determiner consists of one or more single bits calculated using a binary Bose-Chaudhuri-Hocquenghem (BCH) code.
 14. The electronic device as claimed in claim 8, wherein the nub is calculated using a Reed-Solomon code.
 15. A non-transitory computer-readable medium storing instructions which, when executed by a processor of an electronic device, cause the electronic device: to calculate a plurality of determiners from a set of information bits, wherein each determiner is calculated as a first function of a respective first subset of the information bits along a first dimension, and wherein the plurality is an integer greater than four; to calculate, as a second function of the determiners, a nub comprising a number of redundant bits, wherein the number of the redundant bits is less than a number of bits comprised in the plurality of determiners; and to transmit the set of information bits in a first manner over the one or more communications channels; and to transmit the nub in a second manner over the one or more communications channels, wherein the first manner is distinct from the second manner.
 16. The non-transitory computer-readable medium as claimed in claim 15, wherein the first manner is distinguished from the second manner by transmitting over different communications channels.
 17. The non-transitory computer-readable medium as claimed in claim 15, wherein the first manner is distinguished from the second manner by employing different aspects of a modulation format.
 18. The non-transitory computer-readable medium as claimed in claim 15, wherein the nub is logically a portion of a rectangular array comprising the set of information bits.
 19. The non-transitory computer-readable medium as claimed in claim 15, wherein each determiner consists of one or more single bits calculated using a binary Bose-Chaudhuri-Hocquenghem (BCH) code.
 20. The non-transitory computer-readable medium as claimed in claim 15, wherein the nub is calculated using a Reed-Solomon code. 